A local algorithm for finding dense subgraphs
نویسندگان
چکیده
منابع مشابه
A Local Algorithm for Finding Dense Bipartite-Like Subgraphs
We give a local algorithm to extract dense bipartite-like subgraphs which characterize cyber-communities in the Web [13]. We use the bipartiteness ratio of a set as the quality measure that was introduced by Trevisan [20]. Our algorithm, denoted as FindDenseBipartite(v, s, θ), takes as input a starting vertex v, a volume target s and a bipartiteness ratio parameter θ and outputs an induced subg...
متن کاملA Finding dynamic dense subgraphs
Online social networks are often defined by considering interactions of entities at an aggregate level. For example, a call graph is formed among individuals who have called each other at least once; or at least k times. Similarly, in social-media platforms we consider implicit social networks among users who have interacted in some way, e.g., have made a conversation, have commented to the con...
متن کاملFinding Dense Subgraphs
In this paper we establish that the Lovász θ function on a graph can be restated as a kernel learning problem. We introduce the notion of SVM−θ graphs, on which Lovász θ function can be approximated well by a Support vector machine (SVM). We show that Erdös-Rényi random G(n, p) graphs are SVM−θ graphs for log4 n n ≤ p< 1. Even if we embed a large clique of size Θ (√ np 1−p ) in a G(n, p) graph ...
متن کاملOn Finding Dense Subgraphs
Given an undirected graph G = (V,E), the density of a subgraph on vertex set S is defined as d(S) = |E(S)| |S| , where E(S) is the set of edges in the subgraph induced by nodes in S. Finding subgraphs of maximum density is a very well studied problem. One can also generalize this notion to directed graphs. For a directed graph one notion of density given by Kannan and Vinay is as follows: given...
متن کاملFinding Connected Dense k -Subgraphs
Given a connected graph G on n vertices and a positive integer k ≤ n, a subgraph of G on k vertices is called a k-subgraph in G. We design combinatorial approximation algorithms for finding a connected ksubgraph in G such that its density is at least a factor Ω(max{n, k/n}) of the density of the densest k-subgraph in G (which is not necessarily connected). These particularly provide the first n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2010
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1824777.1824780